Generalized Bhattacharyya and Chernoff upper bounds on Bayes error using quasi-arithmetic means
نویسنده
چکیده
Article history: Received 16 April 2013 Available online 24 January 2014
منابع مشابه
Probability of error, equivocation, and the Chernoff bound
-I4 ET US consider the usual decision-theory problem of classifying an observation X ss coming from one of m possible classes (hypotheses) C,, CZ, * , C,. Let nl, .a * , 7~,,, denote the a priori probabilities on the hypotheses, and let p,(x), * * * , p,(x) denote the conditional probability density functions given the true hypothesis. Let us assume that these are known. Then it is well knoti t...
متن کاملVariations on the Gallager bounds, connections, and applications
In recent years there has been renewed interest in deriving tight bounds on the error performance of specific codes and ensembles, based on their distance spectrum. In this paper, we discuss many reported upper bounds on the maximum likelihood decoding error probability and demonstrate the underlying connections that exist between them. In addressing the Gallager bounds and their variations, we...
متن کاملNew Bounding Techniques for Channel Codes over Quasi - Static Fading Channels
New Bounding Techniques for Channel Codes over Quasi-static Fading Channels. (August 2003) Jingyu Hu, B.E., Shanghai Jiao Tong University, P.R.China Chair of Advisory Committee: Dr. Scott L. Miller This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the...
متن کاملError Exponents in Quantum Hypothesis Testing
In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key matrix inequality. Concerning the error exponents, the upper bounds lead to noncommutative analogues of the Chernoff bound and the Hoeffding bound, which are identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. Ou...
متن کاملAn Abstract of the Thesis of Title: on Error Bounds for Linear Feature Extraction. on Error Bounds for Linear Feature Extraction
approved: Raviv Raich Linear transformation for dimension reduction is a well established problem in the field of machine learning. Due to the numerous observability of parameters and data, processing of the data in its raw form is computationally complex and difficult to visualize. Dimension reduction by means of feature extraction offers a strong preprocessing step to reduce the complexity of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 42 شماره
صفحات -
تاریخ انتشار 2014